On the achromatic number of the Cartesian product G1×G2
نویسندگان
چکیده
We study the achromatic number of the Cartesian product of graphs G 1 and G 2 and obtain the following results: (i) maXl<t<rn min{l mn J, t(m + n-1)-t 2 + I}
منابع مشابه
Hadwiger Number and the Cartesian Product Operation on Graphs
The Hadwiger number η(G) of a graph G is defined as the largest integer n for which the complete graph on n nodes Kn is a minor of G. Hadwiger conjectured that for any graph G, η(G) ≥ χ(G),where χ(G) is the chromatic number of G. In this paper, we investigate the Hadwiger number with respect to the cartesian product operation on Graphs. As the main result of this paper, we show that for any two...
متن کاملSharp uppper and lower bounds on the number of spanning trees in Cartesian product graphs
Let G1 and G2 be simple graphs and let n1 = |V (G1)|, m1 = |E(G1)|, n2 = |V (G2)| and m2 = |E(G2)|. In this paper we derive sharp upper and lower bounds for the number of spanning trees τ in the Cartesian product G1 G2 of G1 and G2. We show that: τ(G1 G2) ≥ 2(n1−1)(n2−1) n1n2 (τ(G1)n1) n2+1 2 (τ(G2)n2) n1+1 2 and τ(G1 G2) ≤ τ(G1)τ(G2) [ 2m1 n1 − 1 + 2m2 n2 − 1 ](n1−1)(n2−1) . We also characteri...
متن کاملHadwiger Number and the Cartesian Product of Graphs
The Hadwiger number η(G) of a graph G is the largest integer n for which the complete graph Kn on n vertices is a minor of G. Hadwiger conjectured that for every graph G, η(G) ≥ χ(G), where χ(G) is the chromatic number of G. In this paper, we study the Hadwiger number of the Cartesian product G H of graphs. As the main result of this paper, we prove that η(G1 G2) ≥ h √ l (1− o(1)) for any two g...
متن کاملOn the Strong Product of a k-Extendable and an l-Extendable Graph
Let G1 ⊗ G2 be the strong product of a k-extendable graph G1 and an l-extendable graph G2, and X an arbitrary set of vertices of G1⊗G2 with cardinality 2[(k + 1)(l + 1)/2]. We show that G1 ⊗ G2 − X contains a perfect matching. It implies that G1 ⊗ G2 is [(k + 1)(l + 1)/2]-extendable, whereas the Cartesian product of G1 and G2 is only (k+l+1)extendable. As in the case of the Cartesian product, t...
متن کاملConnectivity and super-connectivity of Cartesian product graphs
This paper determines that the connectivity of the Cartesian product G1 G2 of two graphs G1 and G2 is equal to min{κ1v2, κ2v1, δ1 + δ2}, where vi, κi, δi is the order, the connectivity and the minimum degree of Gi, respectively, for i = 1, 2, and gives some necessary and sufficient conditions for G1 G2 to be maximally connected and super-connected.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Australasian J. Combinatorics
دوره 6 شماره
صفحات -
تاریخ انتشار 1992